Gödel FL_0 with Greatest Fixed-Point Semantics
نویسندگان
چکیده
We study the fuzzy extension of FL0 with semantics based on the Gödel t-norm. We show that gfp-subsumption w.r.t. a nite set of primitive de nitions can be characterized by a relation on weighted automata, and use this result to provide tight complexity bounds for reasoning in this logic.
منابع مشابه
The Fuzzy Description Logic G-FL0 with Greatest Fixed-Point Semantics
We study the fuzzy extension of the Description Logic FL0 with semantics based on the Gödel t-norm. We show that subsumption w.r.t. a finite set of primitive definitions, using greatest fixed-point semantics, can be characterized by a relation on weighted automata. We use this result to provide tight complexity bounds for reasoning in this logic, showing that it is PSpace-complete. If the defin...
متن کاملThe cumulative hierarchy and the constructible universe of ZFA
We present two results which shed some more light on the deep connection between ZFA and the standard ZF set theory: First of all we refine a result of Forti and Honsell (see [5]) in order to prove that the universe of ZFA can also be obtained (without appealing to choice) as the least fixed point of a continuous operator and not only as the greatest fixed point of the powerset operator. Next w...
متن کاملThe Truth Is Sometimes Simple
Note: The following version of this paper does not contain the proofs of the stated theorems. A longer version, complete with proofs, is forthcoming. §1. Introduction. In "The truth is never simple" (1986) and its addendum (1988), Burgess conducts a breathtakingly comprehensive survey of the complexity of the set of truths which arise when you add a truth predicate to arithmetic, and interpret ...
متن کاملKripke semantics for fuzzy logics
Kripke frames (and models) provide a suitable semantics for sub-classical logics; for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and the Basic Logic (of Visser) axiomatizes transitive Kripke frames (with persistent satisfaction relations). Here, we investigate whether Kripke frames/models...
متن کاملA Proof Calculus for Natural Semantics Based on Greatest Fixed Point Semantics
Formal semantics of programming languages needs to model the potentially infinite state transition behavior of programs as well as the computation of their final results simultaneously. This requirement is essential in correctness proofs for compilers. We show that a greatest fixed point interpretation of natural semantics is able to model both aspects equally well. Technically, we infer this i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014